Line search method for solving a non-preemptive strictly periodic scheduling problem
نویسندگان
چکیده
منابع مشابه
Line search method for solving a non-preemptive strictly periodic scheduling problem
We study a non-preemptive strictly periodic scheduling problem. This problem arises for example in the avionic field where a set of N periodic tasks (measure of a sensor, data presentation, etc.) has to be scheduled on P processors distributed on the plane. In this article, we consider an existing heuristic which is based on the notion of equilibrium. Following a game theory analogy, each task ...
متن کاملPropagation mechanism for a non-preemptive strictly periodic scheduling problem
We study a non-preemptive strictly periodic scheduling problem. This problem, introduced in [6, 4], arises for example in the avionic field where a set of N periodic tasks (measure of a sensor, etc.) has to be scheduled on P processors distributed on the plane. In the related field of cyclic scheduling [5], some notable success [3] has been recently achieved through the use of specific constrai...
متن کاملAn Efficient Best Response Heuristic for a Non-preemptive Strictly Periodic Scheduling Problem
In this article, we study an original heuristic for a nonpreemptive strictly periodic scheduling problem, based on the notion of equilibrium. This heuristic was first considered in [1]. Our contribution is to greatly improve its efficiency through a complete redesign of its main method, which is the best response procedure. 1 Problem and method We consider a periodic scheduling problem introduc...
متن کاملA Free Line Search Steepest Descent Method for Solving Unconstrained Optimization Problems
In this paper, we solve unconstrained optimization problem using a free line search steepest descent method. First, we propose a double parameter scaled quasi Newton formula for calculating an approximation of the Hessian matrix. The approximation obtained from this formula is a positive definite matrix that is satisfied in the standard secant relation. We also show that the largest eigen value...
متن کاملa heuristic algorithm for solving single machine scheduling problem with periodic maintenance
in this paper, the scheduling problem with nonresumable jobs and maintenance process is considered in order to minimize the makespan under two alternative strategies. the first strategy is to implement the maintenance process on the machine after a predetermined time period and the second one is to consider the maximum number of jobs that can be done with a special tool. we have proposed a new ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Scheduling
سال: 2014
ISSN: 1094-6136,1099-1425
DOI: 10.1007/s10951-014-0389-6